A Study on Machine Maintenance Scheduling Using Distributed Cooperative Approach
نویسندگان
چکیده
منابع مشابه
Agent-based approach for cooperative scheduling
This paper studies the multi-factory production (MFP) network scheduling problem where a number of different individual factories join together to form a MFP network, in which these factories can operate more economically than operating individually. However, in such network which known as virtual production network with self-interested factories with transportation times, each individual facto...
متن کاملA distributed scheduling methodology for a two-machine flowshop using cooperative-interaction via multiple coupling-agents
This paper presents a distributed scheduling methodology for a two-machine flowshop problem. It is assumed that the decision authorities and information are distributed in multiple sub-production systems that must share two machines in order to satisfy their demands. The associated scheduling problems are modeled using 0/1 integer formulations, and the problem is solved using Lagrangian relaxat...
متن کاملFlow shop Scheduling Problem with Maintenance Coordination: a New Approach
This study investigates the coordination of production scheduling and maintenance planning in theflow shop scheduling environment. The problem is considered in a bi-objective form, minimizing themakespan as the production scheduling criterion and minimizing the system unavailability as themaintenance planning criterion. The time interval between consecutive maintenance activities as well as the...
متن کاملA Single-Machine Distributed-Scheduling Methodology Using Cooperative-Interaction Via Coupling-Agents
This paper considers a single-machine scheduling problem where the decision authorities and information are distributed in multiple sub-production systems. Sub-production systems share the single-machine and must cooperate with each other to achieve a global goal of minimizing a linear function of the completion times of the jobs; e.g., total weighted completion times. It is assumed that neithe...
متن کاملJIT single machine scheduling problem with periodic preventive maintenance
This article investigates a JIT single machine scheduling problem with a periodic preventive maintenance. Also to maintain the quality of the products, there is a limitation on the maximum number of allowable jobs in each period. The proposed bi-objective mixed integer model minimizes total earliness-tardiness and makespan simultaneously. Due to the computational complexity of the problem, mult...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the Society of Instrument and Control Engineers
سال: 2010
ISSN: 0453-4654,1883-8189
DOI: 10.9746/sicetr.46.651